package org.lql.algo.codecrush.hot100.dynamicProgramming;

/**
 * @author: liangqinglong
 * @date: 2025-09-14 13:52
 * @description: 198. 打家劫舍 <a href="https://leetcode.cn/problems/house-robber/description/?envType=study-plan-v2&envId=top-100-liked">...</a>
 **/
public class Rob {

	public int rob(int[] nums) {
		int n = nums.length;
		if (n == 0) {
			return 0;
		}
		if (n == 1) {
			return nums[0];
		}
		int[] dp = new int[n];
		dp[0] = nums[0];
		dp[1] = Math.max(nums[0], nums[1]);
		for (int i = 2; i < n; i++) {
			dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
		}
		return dp[n - 1];
	}

	public static void main(String[] args) {
		Rob rob = new Rob();
		int[] nums = {2, 7, 9, 5, 1};
		System.out.println(rob.rob(nums));
	}
}
